Complexity-guided container replacement synthesis

Containers, such as lists and maps, are fundamental data structures in modern programming languages. However, improper choice of container types may lead to significant performance issues. This paper presents Cres, an approach that automatically synthesizes replacements improve runtime performance. The synthesis algorithm works with static analysis techniques identify how containers utilized the program, attempts select a method lower time complexity for each call. Our can preserve program behavior seize opportunity reducing execution effectively general inputs. We implement Cres evaluate it on 12 real-world Java projects. It is shown projects 384.2 KLoC 14 minutes discovers six categories replacements, which achieve average improvement 8.1%.